Method and device for sharing a candidate list

ABSTRACT

The present invention relates to a method and device for sharing a candidate list. A method of generating a merging candidate list for a predictive block may include: producing, on the basis of a coding block including a predictive block on which a parallel merging process is performed, at least one of a spatial merging candidate and a temporal merging candidate of the predictive block; and generating a single merging candidate list for the coding block on the basis of the produced merging candidate. Thus, it is possible to increase processing speeds for coding and decoding by performing inter-picture prediction in parallel on a plurality of predictive blocks.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a Continuation of U.S. application Ser. No.15/342,751, filed on Nov. 3, 2016, which is a Continuation of U.S.application Ser. No. 14/353,615 filed on Apr. 23, 2014, which is aNational Stage application of International Application No.PCT/KR2012/009427, filed on Nov. 8, 2012, which claims the benefit ofpriority of Korean Patent Application No. 10-2011-0115607 filed on Nov.8, 2011, Korean Patent Application No. 10-2011-0116527 filed on Nov. 9,2011, Korean Patent Application No. 10-2011-0121428 filed on Nov. 21,2011, Korean Patent Application No. 10-2011-0124813 filed on Nov. 28,2011, Korean Patent Application No. 10-2011-0140861 filed on Dec. 23,2011, Korean Patent Application No. 10-2012-0011412 filed on Feb. 3,2012, and Korean Patent Application No. 10-2012-0126369 filed on Nov. 8,2012, all of which is are incorporated by reference in its theirentirety herein.

BACKGROUND OF THE INVENTION Field of the Invention

The present invention relates to a video processing method and anapparatus using the method and more particularly, an inter-predictionmethod and an apparatus using the method.

Related Art

There is growing demand for high resolution, high quality video such asHD (High Definition) and UHD (Ultra High Definition) video in a host ofapplications. Since the amount of data to be handled at higherresolution and/or quality is relatively large compared with theconventional video data, costs for transmission and storage aresubsequently increased when video data are transmitted through theexisting wired or wireless broadband lines or stored in the conventionalstorage media. To solve the problems caused by high resolution, highquality video data, highly efficient compression techniques may beutilized.

Current video compression techniques include an inter-predictiontechnique which predicts pixel values of a current video frame by usingits previous or subsequent video frame, an intra-prediction techniquewhich predicts pixel values of a current video frame by using pixelinformation within the current frame, an entropy encoding method whichassigns a short codeword to those pixel values with high frequency andassigns a long codeword to those pixel values with low frequency, and soon. Video data can be compressed efficiently by using the videocompression techniques above and subsequently transmitted or stored.

SUMMARY OF THE INVENTION

An objective of the present invention is to provide a method forcarrying out inter-prediction for prediction blocks in a parallelfashion by generating a single candidate list.

Another objective of the present invention is to provide an apparatusfor carrying out inter-prediction for prediction blocks in a parallelfashion by generating a single candidate list.

To achieve the objective above, a method for generating a list ofmerging candidates for prediction blocks according to one aspect of thepresent invention comprises deriving based on an coding block includingthe prediction block at least one merging candidate from a spatialmerging candidate and a temporal merging candidate of the predictionblock for which a parallel merge processing is applied; and based on themerging candidate derived, generating a single merging candidate listwith respect to the coding block. The deriving based on a coding blockincluding the prediction block at least one merging candidate from aspatial merging candidate and a temporal merging candidate of theprediction block to which parallel merge processing can be appliedcomprises deriving a spatial merging candidate block and a temporalmerging candidate block based on pixel position and size of the codingblock and deriving motion prediction-related information of an availablemerging candidate block from the derived spatial merging candidate blockand the temporal merging candidate block as the merging candidate. Themethod for generating a merging candidate list for prediction blocksfurther comprises determining whether parallel merge processing can beapplied to the prediction block; and the determining whether parallelmerge processing can be applied to a prediction block comprises decodingsize information of a block to which parallel merge processing can beapplied and determining whether parallel merge processing can be appliedto the prediction block based on size information of the block to whichparallel merge processing can be applied and size information of thecoding block. The deriving motion prediction-related information of anavailable merging candidate block from the derived spatial mergingcandidate block and the temporal merging candidate block as the mergingcandidate comprises determining whether the coding block and a spatialmerging candidate block derived based on the coding block belong to theinside of the block to which parallel merge processing can be applied;and in case the coding block and the spatial merging candidate blockderived based on the coding block belong to the inside of the block towhich parallel merge processing can be applied, determining the spatialmerging candidate block as a unavailable spatial merging candidateblock. The determining whether the prediction block is to which parallelmerge processing can be applied based on size information of the blockto which parallel merge processing can be applied and size informationof the coding block comprises determining whether the size of a block towhich parallel merge processing can be applied is larger than apredetermined size, determining whether the coding block is of aparticular size, and in case the size of the block to which parallelmerge processing can be applied is larger than the predetermined sizeand the coding block is of the particular size, determining that mergingis carried out for the prediction block by using the single mergingcandidate list. The method for generating a merging candidate list for aprediction block further comprises deriving the spatial mergingcandidate block and the temporal merging candidate block based on pixelposition and size of the prediction block in case the prediction blockis not to which parallel merge processing can be applied; and derivingmotion prediction-related information of an available merging candidateblock from the spatial merging candidate block and the temporal mergingcandidate block derived as the merging candidate. The deriving motionprediction-related information of an available merging candidate blockfrom the spatial merging candidate block and the temporal mergingcandidate block derived as the merging candidate comprises determiningwhether the prediction block corresponds to a block divided into one ofN×2N, nL×2N and nR×2N form and the prediction block corresponds to asecond prediction block; and in case the prediction block corresponds tothe block divided into one of N×2N, nL×2N and nR×2N form and theprediction block corresponds to a second prediction block, determining aspatial merging candidate block included in a first prediction block asa unavailable block. The deriving motion prediction-related informationof an available merging candidate block from the spatial mergingcandidate block and the temporal merging candidate block derived as themerging candidate comprises determining whether the prediction blockcorresponds to a block divided into one of 2N×N, 2N×nU and 2N×nD formand the prediction block corresponds to a second prediction block; andin case the prediction block corresponds to the block divided into oneof 2N×N, 2N×nU and 2N×nD form and the prediction block corresponds tothe second prediction block, determining a spatial merging candidateblock included in the first prediction block as a unavailable block.

To achieve the objective of the present invention above, a videodecoding apparatus according to one aspect of the present inventioncomprises a prediction unit. The prediction unit derives based on acoding block including the prediction block at least one mergingcandidate from a spatial merging candidate and a temporal mergingcandidate of the prediction block to which a parallel merge process canbe applied; and based on the merging candidate derived, generates asingle merging candidate list with respect to the coding block. Toderive based on a coding block including the prediction block at leastone merging candidate from a spatial merging candidate and a temporalmerging candidate of the prediction block to which parallel mergeprocessing can be applied, the prediction unit derives a spatial mergingcandidate block and a temporal merging candidate block based on pixelposition and size of the coding block and derives motionprediction-related information of an available merging candidate blockfrom the derived spatial merging candidate block and the temporalmerging candidate block as the merging candidate. The prediction unitdetermines whether parallel merge processing can be applied to theprediction block; and to determine whether parallel merge processing canbe applied to the prediction block, determines based on size informationof a decoded block to which parallel merge processing can be applied andsize information of the coding block whether parallel merge processingcan be applied to the prediction block. The prediction unit, to derivemotion prediction-related information of an available merging candidateblock from the spatial merging candidate block and the temporal mergingcandidate block derived as the merging candidate, determines whether thecoding block and a spatial merging candidate block derived based on thecoding block belong to the inside of the block to which parallel mergeprocessing can be applied; and in case the coding block and the spatialmerging candidate block derived based on the coding block belong to theinside of the block to which parallel merge processing can be applied,determines the spatial merging candidate block as a unavailable spatialmerging candidate block. To determine whether parallel merge processingcan be applied to the prediction unit based on size information of theblock to which parallel merge processing can be applied and sizeinformation of the coding block, the prediction unit determines whetherthe size of a block to which parallel merge processing can be applied islarger than a predetermined size, determines whether the coding block isof a particular size, and in case the size of the block to whichparallel merge processing can be applied is larger than thepredetermined size and the coding block is of the particular size,determines that merging is carried out for the prediction block by usingthe single merging candidate list. The prediction unit derives thespatial merging candidate block and the temporal merging candidate blockbased on pixel position and size of the prediction block in caseparallel merge processing cannot be applied to the prediction block; andderives motion prediction-related information of an available mergingcandidate block from the derived spatial merging candidate block and thetemporal merging candidate block as the merging candidate. To derivemotion prediction-related information of an available merging candidateblock from the spatial merging candidate block and the temporal mergingcandidate block derived as the merging candidate, the prediction unitdetermines whether the prediction block corresponds to a block dividedinto one of N×2N, nL×2N and nR×2N form and the prediction blockcorresponds to a second prediction block; and in case the predictionblock corresponds to the block divided into one of N×2N, nL×2N and nR×2Nform and the prediction block corresponds to a second prediction block,determines a spatial merging candidate block included in a firstprediction block as a unavailable block. To derive motionprediction-related information of an available merging candidate blockfrom the spatial merging candidate block and the temporal mergingcandidate block derived as the merging candidate, the prediction unitdetermines whether the prediction block corresponds to a block dividedinto one of 2N×N, 2N×nU and 2N×nD form and the prediction blockcorresponds to a second prediction block; and in case the predictionblock corresponds to the block divided into one of 2N×N, 2N×nU and 2N×nDform and the prediction block corresponds to the second predictionblock, determines a spatial merging candidate block included in thefirst prediction block as a unavailable block.

According to a method for sharing a candidate list and an apparatususing the method according to an embodiment of the present invention,complexity due to inter-prediction is lowered as the inter-prediction iscarried out while a single candidate list is shared among a plurality ofprediction blocks divided from one coding block. Also, sinceinter-prediction is carried out in a parallel fashion for a plurality ofprediction blocks, processing speed of encoding and decoding can beimproved.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram illustrating the structure of a video encodingapparatus according to one embodiment of the present invention.

FIG. 2 is a block diagram illustrating the structure of a video decodingapparatus according to another embodiment of the present invention.

FIG. 3 is a conceptual drawing illustrating a method forinter-prediction using merging according to an embodiment of the presentinvention.

FIG. 4 is a conceptual drawing illustrating a case where one codingblock is divided into two prediction blocks.

FIG. 5 is a conceptual drawing illustrating inter-prediction using atemporal merging candidate and a reference picture index of the temporalmerging candidate according to an embodiment of the present invention.

FIG. 6 is a conceptual drawing illustrating a method for generating asingle merging candidate list by sharing both a spatial mergingcandidate and a temporal merging candidate in a plurality of predictionblocks according to an embodiment of the present invention.

FIG. 7 is a conceptual drawing illustrating a method for generating asingle merging candidate list by sharing only a spatial mergingcandidate in a plurality of prediction block according to an embodimentof the present invention.

FIG. 8 is a conceptual drawing illustrating a method for generating asingle merging candidate list by only a temporal merging candidate in aplurality of prediction block according to an embodiment of the presentinvention.

FIG. 9 is a conceptual drawing illustrating an inter-prediction modeusing AMVP.

FIG. 10 is a conceptual drawing illustrating a method for generating asingle motion vector prediction candidate list by sharing both a spatialcandidate prediction block and a temporal candidate prediction block ina plurality of prediction blocks according to an embodiment of thepresent invention.

FIG. 11 is a conceptual drawing illustrating a method for generating asingle motion vector prediction candidate list by sharing only a spatialcandidate prediction block in a plurality of prediction blocks accordingto an embodiment of the present invention.

FIG. 12 is a conceptual drawing illustrating a method for generating asingle motion vector prediction candidate list by sharing only atemporal candidate prediction block in a plurality of prediction blocksaccording to an embodiment of the present invention.

FIG. 13 is a conceptual drawing illustrating a method for generating asingle merging candidate list according to an embodiment of the presentinvention.

FIG. 14 is a conceptual drawing illustrating a method for generating asingle merging candidate list according to an embodiment of the presentinvention.

FIG. 15 is a conceptual drawing illustrating a method for generating asingle merging candidate list according to an embodiment of the presentinvention.

FIG. 16 is a conceptual drawing illustrating a method for generating amerging candidate list according to an embodiment of the presentinvention.

FIG. 17 is a conceptual drawing illustrating a position of a spatialmerging candidate according to a division form of a coding blockaccording to an embodiment of the present invention.

FIG. 18 is a conceptual drawing illustrating a method for generating amerging candidate list according to an embodiment of the presentinvention.

FIG. 19 is a conceptual drawing illustrating a position of a spatialmerging candidate according to a division form of a coding blockaccording to an embodiment of the present invention.

FIG. 20 is a conceptual drawing illustrating a position of a spatialmerging candidate according to a division form of a coding blockaccording to an embodiment of the present invention.

FIG. 21 is a conceptual drawing illustrating a position of a spatialmerging candidate according to a division form of a coding blockaccording to an embodiment of the present invention.

FIG. 22 is a conceptual drawing illustrating a position of a spatialmerging candidate according to a division form of a coding blockaccording to an embodiment of the present invention.

FIG. 23 is a conceptual drawing illustrating a procedure through which aplurality of prediction blocks are decoded and encoded in a parallelfashion when a method for generating a single candidate list accordingto an embodiment of the present invention is used.

DESCRIPTION OF EXEMPLARY EMBODIMENTS

In what follows, preferred embodiments according to the presentinvention will be described with reference to appended drawings. Indescribing embodiments of the present invention, if it is determinedthat specific descriptions about related structure of functionswill-known to the public may mislead the technical principles of thepresent invention, the corresponding descriptions will be omitted.

If some constituting element is mentioned to be “linked” or “connected”to another constituting element, the element may be linked or connectedto the another element directly but it should be understood that anotherelement may exist between the two elements. Also, what is meant to be“included” in the present invention should be understood that it doesnot exclude other components other than those explicitly included in thedocument and additional structure can be included in an embodiment ortechnical scope of the present invention.

The terms of first, second, and the like can be used to describe variousconstituting elements but the constituting elements should not belimited by the terms. Rather, the terms are used only for distinguishingone constituting element from the others. For example, a firstconstituting element can be called a second constituting element withoutdeparting the scope of claims of the present invention and vice versa.

Meanwhile, constituting units in the embodiments of the presentinvention are illustrated independently to describe characteristicfunctions different from each other and thus do not indicate that eachconstituting unit comprises separate units of hardware or software. Inother words, each constituting unit is described as such for theconvenience of description; thus, at least two constituting units mayfrom a single unit and at the same time, a single unit may provide anintended function while it is divided into multiple sub-units and anintegrated embodiment of individual units and embodiments performed bysub-units all should be understood to belong to the claims of thepresent invention as long as those embodiments belong to the technicalscope of the present invention.

In addition, some of constituting elements are not crucial for carryingout fundamental functions of the present invention; instead they mayhave been introduced optionally to improve the performance of thefunctions. The present invention can be implemented by using only thoseelements essential to realize the technical principles of the presentinvention without employing the optional elements used for performanceenhancement. It should be understood that configurations comprising onlythose essential elements excluding the optional ones used only forperformance enhancement still belong to the technical scope of thepresent invention.

FIG. 1 is a block diagram illustrating the structure of a video encodingapparatus according to one embodiment of the present invention.

With reference to FIG. 1, the video encoding apparatus 100 comprises amotion prediction unit 111, a motion compensation unit 112, anintra-prediction unit 120, a switch 115, a subtraction unit 125, atransform unit 130, a quantization unit 140, an entropy encoding unit150, an inverse quantization unit 160, an inverse transform unit 170, anadder 175, a filter 180, and a reference picture buffer 190.

The video encoding apparatus 100 carries out encoding an input video inan intra or inter mode and produces a bit stream. In case of an intramode, the switch 115 switches to intra while in case on an inter mode,the switch 115 switches to inter. The video encoding apparatus 100,after deriving a prediction block with respect to an input block,encodes the residual between the input and the prediction block.

An intra mode is defined as an in-picture prediction mode while an intermode is defined as an inter-picture prediction mode; an intra predictionunit 120 may be called an in-picture prediction unit while a motionprediction unit 111 and a motion compensation unit 112 an inter-pictureprediction unit.

In case of intra mode, the intra prediction unit 120 carries out spatialprediction by using pixel values of a pre-encoded block around a currentblock and derives a prediction block.

In case of inter mode, the motion prediction unit 111 can obtain amotion vector by searching a reference frame stored in a referencepicture buffer 190 for an area most matches with an input block during amotion prediction process. The motion compensation unit 112 can derive aprediction block by carrying out motion compensation by using the motionvector.

The subtraction unit 125 derives a residual block based on a residuebetween an input block and a derived prediction block. The transformunit 130 produces transform coefficients by carrying out transformationof the residual block. Here, the transform coefficients implycoefficient values obtained by applying transformation to the residualblock and/or a residual signal. For the following part of this document,quantized transform coefficient levels, derived by applying quantizationto transform coefficients, can also be called transform coefficients.

The quantization unit 140 quantizes input transform coefficientsaccording to quantization coefficients and outputs quantized transformcoefficient levels.

The entropy encoding unit 150 carries out entropy encoding based on thevalues derived by the quantization unit 140 or encoding parametersderived through an encoding process; and outputs a bit stream.

In case of entropy encoding a small number of bits are assigned to asymbol with a high probability of occurrence whereas a large number ofbits are assigned to the symbol with a low probability of occurrence,thereby reducing the size of a bit stream for symbols to be encoded.Therefore, compression performance of video encoding can be enhancedthrough entropy encoding. The entropy encoding unit 150 can utilizeencoding method such as exponential golomb, CAVLC (Context-AdaptiveVariable Length Coding), CABAC (Context-Adaptive Binary ArithmeticCoding), and so on for entropy encoding.

Since the video encoding apparatus according to the embodiment of FIG. 1carries out inter prediction encoding, namely inter-frame predictionencoding, it is necessary for a currently encoded frame to be decodedand stored so that it can be used as a reference frame. Therefore,quantized coefficients are inversely quantized by the inversequantization unit 160 and inversely transformed by the inverse transformunit 170. The inversely quantized, transformed coefficients are added toa prediction block through the adder 175 and a reconstructed block isobtained.

The reconstructed block passes through the filter 180 and the filter 180can apply at least one or more of a deblocking filter, SAO (SampleAdaptive Offset), and ALF (Adaptive Loop Filter) to the reconstructedblock or a reconstructed picture. The reconstructed block which haspassed through the filter 180 can be stored in the reference picturebuffer 190.

FIG. 2 is a block diagram illustrating the structure of a video decodingapparatus according to another embodiment of the present invention.

With reference to FIG. 2, the video decoding apparatus 200 comprises anentropy decoding unit 210, an inverse quantization unit 220, an inversetransform unit 230, an intra prediction unit 240, a motion compensationunit 250, an adder 255, a filter 260, and a reference picture buffer270.

The video decoding apparatus 200 receives a bit stream output from anencoder and carries out decoding in an intra or inter mode and producesa reconfigured video, namely reconstructed video. In case of an intramode, the switch switches to intra while in case of an inter mode, theswitch switches to inter. The video decoding apparatus 200 obtains areconstructed residual block from an input bit stream and derives aprediction block and produces a reconfigured block, namely areconstructed block by adding the residual block and the predictionblock.

The entropy decoding unit 210 applies entropy decoding to the input bitstream according to a probability distribution and produces symbols inthe form of quantized coefficients. An entropy decoding method issimilar to the entropy encoding method described above.

In case an entropy decoding method is applied, a small number of bitsare assigned to a symbol with a high probability of occurrence while alarge number of bits are assigned to a symbol with a low probability ofoccurrence, thereby reducing the size of a bit stream for each symbol.Therefore, compression performance of video decoding can be enhancedthrough an entropy decoding method.

Quantized coefficients are inversely quantized by the inversequantization unit 220 and inversely transformed by the inverse transformunit 230; a reconstructed residual block is obtained as quantizedcoefficients are inversely quantized/inversely transformed.

In case of an intra mode, the intra prediction unit 240 obtains aprediction block by carrying out spatial prediction by using pixelvalues of a pre-decoded block around a current block. In case of aninter mode, the motion compensation unit 250 obtains a prediction unitby carrying out motion compensation by using a motion vector and areference frame stored in the reference picture buffer 270.

The reconstructed residual block and the prediction block are addedtogether by the adder 255 and the added block is passed through thefilter 260. The filter 260 applies at least one or more of a deblockingfilter, SAO, and ALF to the reconstructed block or picture. The filter260 outputs a reconfigured frame, namely, a reconstructed frame. Thereconstructed frame is stored in the reference picture buffer 270 andused for inter prediction.

Methods for improving prediction performance of an encoding/decodingapparatus include a method of increasing accuracy of an interpolatedvideo frame and a method of predicting a difference signal. In thepresent invention, a “difference signal” can be substituted by a“residual block” or “difference block” depending on the context and itshould be understood by those skilled in the art that the terminologiescan be differentiated from each other without influencing on thetechnical principles of the present invention.

In the embodiments of the present invention, a coding unit (CU), aprediction unit (PU), or a transform unit (TU) is used to refer to theunit of processing a video frame.

A coding unit is a video processing unit with which encoding/decoding iscarried out and includes an coding block which is a block-wise set ofbrightness samples or chrominance samples to which encoding/decoding isapplied and information used for encoding or decoding samples of thecoding block.

A prediction unit is a video processing unit with which prediction iscarried out and includes a prediction block which is a block-wise set ofbrightness samples or chrominance samples to which prediction isperformed and information used for predicting samples of the predictionblock. The coding block can be divided into a plurality of predictionblocks.

A transform unit is a video processing unit with which transformation iscarried out and includes a transform block which is a block-wise set ofbrightness samples or chrominance samples to which transformation isapplied and information used for transforming samples of the transformblock. The coding block can be divided into a plurality of transformblocks.

In what follows, unless otherwise explicitly stated, a block and a unitare interpreted to have the same meaning as each other.

Also, a current block refers to a block for which a particular videoprocessing is carried out such as a prediction block for whichprediction is currently carried out or a coding block for which encodingis currently carried out. For example, in case one coding block isdivided into two prediction blocks, one of the two blocks for whichprediction is carried out can be called a current block.

A video encoding method and a video decoding method to be describedlater in an embodiment of the present invention can be carried out inthe individual units included in the video encoder and the video decoderdescribed above in FIGS. 1 and 2. Each of the individual units mayinclude a software-processing unit which can be carried out by analgorithm as well as a hardware-based processing unit.

In the following, a method for generating a merging candidate listdescried in an embodiment of the present invention can be utilized bothfor a SKIP mode in a video processing method and merging which is one ofinter-prediction methods. The SKIP mode is a video processing methodwhich outputs a block predicted based on motion prediction informationderived from a neighboring block as a reconstruction block withoutgenerating a residual block. The merging, which is one ofinter-prediction methods, is a video processing method which isequivalent to the SKIP mode in a sense that a predicted block isgenerated based on motion prediction information derived from aneighboring block but produces a reconstruction block from a residualblock and a prediction block by additionally encoding and decodingresidual block information. An in-loop filtering method such asdeblocking filtering and sample-adaptive offset can be appliedadditionally to the reconstruction block produced.

FIG. 3 is a conceptual drawing illustrating a method forinter-prediction using merging according to an embodiment of the presentinvention.

With reference to FIG. 3, inter prediction based on merging is carriedout as described below.

Inter prediction based on merging refers to a method of carrying outinter prediction deriving merging candidates from neighboring blocksaround a current block and carrying out inter prediction by using themerging candidates. Neighboring blocks used for deriving mergingcandidates can be classified into those blocks adjacent to a currentblock while belonging to the same picture as the current block and thoseblocks belonging to a different picture from the current block butco-located with the current block.

In the following of the present invention, a spatial merging candidateblock is defined as a block among neighboring blocks used for derivingmerging candidates, which is adjacent to a current block and belongs tothe same picture as the current block. Meanwhile, motionprediction-related information derived from a spatial merging candidateblock is called a spatial merging candidate. A temporal mergingcandidate block is defined as a block among neighboring blocks used forderiving merging candidates, which is co-located with the current blockbut belongs to a different picture from the current block. Motionprediction-related information derived from a temporal merging candidateblock is called a temporal merging candidate.

In other words, an inter prediction method using merging can bedescribed as an inter prediction method which predicts a current blockby using motion prediction-related information of a spatial mergingcandidate block (spatial merging candidate) or motion prediction-relatedinformation of a temporal merging candidate block (temporal mergingcandidate) to be described later.

Motion vector (mvL0/L1), reference picture index (refIdxL0/L1), andreference picture list utilization information (predFlagL0/L1) may beused for motion prediction-related information. FIG. 3A illustratesMotion vector (mvL0/L1), reference picture index (refIdxL0/L1), andreference picture list utilization information (predFlagL0/L1).

The motion vector 304 provides directivity information and used for aprediction block to derive pixel information related to a particularposition of a reference picture while inter prediction is carried out.In case inter prediction is carried out in a prediction block by using aplurality of directivity information, a motion vector for each directioncan be represented by using mvL0 and mvL1.

The reference picture index 306 provides index information about areference picture for a prediction block to carry out inter prediction.In case inter prediction is carried out by using a plurality ofreference pictures, each reference picture used can be indexed by usingthe reference picture index refIdxL0 and refIdL1.

The reference picture list utilization information indicates whichreference picture list 308 a reference picture has been derived from.For example, i, j, k picture can be stored in a reference picture list 0308. In case there are two lists in which a reference picture is stored,information indicating a reference picture list from which the referencepicture is derived can be represented by predFlagL0 and predFlagL1.

In order to carry out an inter prediction method by using merging, firstof all, a spatial merging candidate is obtained through the step (1)below. FIG. 3B illustrates a spatial merging candidate and a temporalmerging candidate.

(1) A spatial merging candidate is derived from blocks adjacent to acurrent block (a prediction target block).

As described above, a spatial merging candidate provides motionprediction-related information derived from a spatial merging candidateblock. The spatial merging candidate block can be derived with respectto the position of a current block.

With reference to FIG. 3B, existing spatial merging candidate blocks300, 310, 320, 330, 340 are derived with respect to a prediction block.Suppose the position of a pixel located in the top-left of theprediction block is (xP, yP); width of the prediction block nPbW; heightof the prediction block nPbH; and MinPbSize represents the size of thesmallest prediction block. Then, in the following of the presentinvention, a spatial merging candidate block of the prediction blockdescribes a block containing a pixel at (xP−1, yP+nPbH) as a left firstblock (or A0 block, 300); a block containing a pixel at (xP−1,yP+nPbH−1) as a left second block (or A1 block, 310); a block containinga pixel at (xP+nPbW, yP−1) as a top first block (or B0 block, 320); ablock containing a pixel at (xP+nPbW−1, yP−1) as a top second block (orB1 block, 330); and a block containing a pixel at (xp_1, yP−1) as a topthird block (or B2 block, 340). Instead of using 1 as an index, adifferent value, for example, “MinPbSize” can be used and in this case,too, blocks at the same physical position can be indexed. Coordinatesused for specifying the blocks at particular position are chosenarbitrarily and the same blocks can be specified by using various otherexpressions.

The positions and the number of the spatial merging candidate blocks300, 310, 320, 330, 340 and the positions and the number of the temporalmerging candidate blocks 360, 370 described in FIG. 3 are arbitrary;therefore, the positions and the number of the spatial merging candidateblocks and the positions and the number of the temporal mergingcandidate blocks can vary as long as they do not leave the technicalscope of the present invention. Also, the order of merging candidateblocks to be scanned at the time of constructing a merging candidatelist can be changed. In other words, in what follows, positions, thenumber, a scan order, a candidate prediction group of candidateprediction blocks used at the time of constructing a candidateprediction motion vector list described in an embodiment of the presentinvention are only an example, which can be changed as long as they fallwithin the technical scope of the present invention.

Availability of a spatial merging candidate block 300, 310, 320, 330,340 is determined and from the available spatial merging candidateblock, a spatial merging candidate can be derived. Availabilityinformation provides the information indicating whether a spatialmerging candidate can be derived from a spatial merging candidate. Forexample, in case a spatial merging candidate block is located outside ofa slice, a tile, or a picture to which a current block belongs or intraprediction has been carried out for the spatial merging candidate block,a spatial merging candidate, which is motion prediction-relatedinformation, cannot be derived; in this case, it may be determined thata spatial merging candidate block is not available. Various methods canbe used to determine availability information of a spatial mergingcandidate. Additional descriptions will be provided for such anembodiment.

Motion prediction-related information can be derived for an availablespatial merging candidate block and used for predicting a current block.

One coding block can be divided into at least one prediction block. Inother words, a coding block may include one or more prediction blocks.In case more than one prediction block is included in a coding block, aprediction block can be indexed by particular index information. Forexample, if one coding block is divided into two prediction blocks, thetwo prediction blocks can be indexed by assigning a partition index 0 toone of the blocks while assigning a partition index 1 to the otherblock. Different terms can be used in such a way that the block ofpartition index 0 is termed a first prediction block while the block ofpartition index 1 is termed a second prediction block. If one codingblock is further divided into additional prediction blocks, the indexvalue specifying the prediction blocks can be increased accordingly. Theterms defined for specifying prediction blocks are arbitrarily chosen;therefore, they can be utilized or interpreted in a different way.

The partition index of a prediction block can be used as information fordescribing an order of video processing such as encoding or decodingcarried out by the prediction block. Also, in the following, a methodfor sharing a single candidate list according to an embodiment of thepresent invention describes a parallel merge process by newly defining ablock to which parallel merge processing can be applied. A block towhich parallel merge processing can be applied can be defined as a unitincluding at least one coding block or a plurality of prediction blocks,which will be described additionally in the following.

In case of deriving a spatial merging candidate for each predictionblock, if one coding block is divided into two prediction blocks, aspatial merging candidate has to be derived for each block. In thiscase, a spatial merging candidate for the other prediction block has towait to be derived until encoding or decoding of one prediction blockincluded in one coding block is completed. This is because some spatialmerging candidate block 310 is included in another prediction block andis allowed to derive a spatial merging candidate block only when thecorresponding prediction block finishes encoding or decoding and anotherspatial merging candidate block 300 located at some position has notcarried out encoding or decoding yet. In other words, in case of acoding block including a plurality of prediction units, encoding ordecoding for each of prediction blocks cannot be carried out in aparallel fashion. FIG. 4 illustrates the aforementioned problem in moredetail.

FIG. 4 is a conceptual drawing illustrating a case where one codingblock is divided into two prediction blocks.

With reference to FIG. 4, one coding block is divided into a firstprediction block 400 and a second prediction block 420, both of whichhave an N×2N form. A spatial merging candidate of the first predictionblock 400 is derived based on the position of the first prediction blockas shown in FIG. 4A while a spatial merging candidate block of a secondprediction block 420 is derived based on the position of the secondprediction block 420 as shown in FIG. 4B. Although temporal mergingcandidate blocks are not shown, the temporal merging candidate isderived based on the position of each prediction block.

The spatial merging candidate block of the first prediction block 400 isthe one located outside of the first prediction block 400 and ispositioned where encoding or decoding is already completed.

However, A1 block 430 from among spatial merging candidate blocks of thesecond prediction block 420 belongs to the inside of the firstprediction block 400. Therefore, after prediction of the firstprediction block 400 is carried out, motion prediction-relatedinformation of the A1 block 430 can be known. In other words, aprocedure of generating a merging candidate list of the secondprediction block 420 is carried out after a merging candidate list ofthe first prediction block 400 is generated.

FIG. 4C illustrates an order of generating a merging candidate list whenone coding block is divided into two prediction blocks.

With reference to FIG. 4C, in case one coding block is divided into aplurality of prediction blocks during an encoding or decoding process, aprocess of generating a merging candidate list about a plurality ofprediction blocks cannot be carried out in a parallel fashion but aprocess of generating a merging candidate list about a plurality ofprediction blocks can be carried out sequentially for each of predictionblocks instead.

A method for sharing a candidate list and an apparatus using the methodaccording to an embodiment of the present invention describes a methodfor a plurality of prediction units divided from one coding block toshare a merging candidate list in deriving a spatial and temporalmerging candidate. A merging candidate list shared by a plurality ofprediction units is defined by the term of single merging candidatelist.

In other words, the present invention provides a method for carrying outinter prediction using a plurality of prediction blocks based on asingle merging candidate list of a couple of prediction blocks includedin coding blocks divided from a coding block. Complexity due togenerating a merging candidate list several times for individualprediction blocks can be reduced by employing a single merging candidatelist. Also, encoding or decoding of a plurality of prediction blocksdivided within one coding block which carries out inter prediction bymerging can be carried out in parallel.

In what follows, a method for generating a single merging candidate listwill be described additionally in an embodiment of the presentinvention.

(2) A reference picture index of a temporal merging candidate isconfigured.

A temporal merging candidate provides motion prediction-relatedinformation derived from a picture containing a current block and atemporal merging candidate block belonging to another picture. Atemporal merging candidate block is derived based on a block at aco-located position with respect to the position of a current block. Theterm of call block may also be used in the same meaning as the temporalmerging candidate block.

Again with respect to FIG. 3, if a block including a pixel at (xP+nPSW,yP+nPSH) in a co-located picture of a current prediction block or ablock including a pixel at (xP+nPSW, yP+nPSH) is not available withrespect to a pixel position (xP, yP) within a picture including aprediction block, a temporal merging candidate block 360, 370 can serveas a block including a pixel at (xP+(nPSW>>1), yP+(nPSH>>1)). Aprediction block including a pixel at (xP+nPSW, yP+nPSH) in a co-locatedpicture is called a first temporal merging candidate block (or a firstco-located block 360) while a prediction block including a pixel at(xP+(nPSW>>1), yP+(nPSH>>1)) in a co-located picture is called a secondtemporal merging candidate block 370. The position of a final temporalmerging candidate block used for deriving a temporal merging candidate(motion prediction-related information) may correspond to the blocklocated at a position moved a little with respect to the positions ofthe first 360 and the second temporal merging candidate block 370. Forexample, in case only part of motion prediction-related information of aprediction block belonging to the co-located picture is stored in amemory, a block located at a position moved a little with respect to thepositions of the first 360 and the second temporal merging candidateblock 370 can be used as a final temporal merging candidate block whichderives final motion prediction-related information. In the same manneras a spatial merging candidate block, the position of a temporal mergingcandidate block can be changed or augmented differently from FIG. 3 andan embodiment describing the case will be described later.

The reference picture index of a temporal merging candidate providesinformation specifying a picture referred to for a current block tocarry out inter prediction based on a motion vector (mvLXCol) derivedfrom a temporal merging candidate.

FIG. 5 is a conceptual drawing illustrating inter-prediction using atemporal merging candidate and a reference picture index of the temporalmerging candidate according to an embodiment of the present invention.

With reference to FIG. 5, a current block 500, a picture 510 includingthe current block, a temporal merging candidate block 520, and aco-located picture 530 including a call block can be defined.

With respect to the temporal merging candidate block 520, there exists apicture 540 used for the temporal merging candidate block to apply interprediction for the temporal merging candidate block 520. Such a pictureis defined as the reference picture 540 of the co-located picture 530.Also, a motion vector used for the temporal merging candidate block 520to carry out inter prediction from the reference picture 540 of theco-located picture can be defined as mvCol 570.

With respect to the current block 500, a reference picture 560 used forinter prediction of the current block 500 based on the derived mvCol 570has to be defined. The reference picture defined to be used for interprediction of the current block 500 can be called a reference picture560 of the temporal merging candidate. In other words, the referenceindex 560 of the temporal merging candidate is used to specify areference picture used for temporal motion prediction of the currentblock 500. The step (2) derives a reference picture index of thetemporal merging candidate as described above.

The motion vector mvCol 570 derived from the temporal merging candidateblock 520 can be scaled and modified into another value according to therelationship of the distance between the co-located picture 30 and thereference picture 540 of the co-located picture and the distance betweenthe picture 510 including the current block and the reference picture560 of the temporal merging candidate derived through the step (2).

In other words, inter prediction through the temporal merging candidateof the current block 500 can be carried out through mvLXCol 580 derivedthrough the step (3) described later, which is based on the referencepicture index 560 of the temporal merging candidate derived through thestep (2) and the reference picture index 560 of the temporal mergingcandidate. mvLXCol can be defined as a temporal motion vector.

(3) Motion prediction-related information of a temporal mergingcandidate is derived.

Step (3) derives a temporal merging candidate such as information aboutwhether a temporal merging candidate block is available, referencepicture list utilization information (predFlagLXCol), and motion vectorinformation of the temporal merging candidate to carry out motionprediction based on the temporal merging candidate The availabilityinformation of the temporal merging candidate block provides informationabout whether a temporal merging candidate can be derived from atemporal merging candidate block. Based on the availability informationof a temporal merging candidate block, a temporal merging candidate canbe included in a merging candidate list.

(4) A merging candidate list is derived.

A merging candidate list includes information about a merging candidatewhich can be used for inter prediction by merging based on theavailability information of a merging candidate block (a spatial mergingcandidate block or a temporal merging candidate block). One mergingcandidate included in the merging candidate list can be used forpredicting a current block. Information about which merging candidate isused for predicting a current block (merge index) is encoded in anencoding process and transmitted to a decoder.

The merging candidate list can be generated according to the prioritiesas described below.

-   1) A merging candidate derived from A1 block in case the A1 block is    available-   2) A merging candidate derived from B1 block in case the B1 block is    available-   3) A merging candidate derived from B0 block in case the B0 block is    available-   4) A merging candidate derived from A0 block in case the A0 block is    available-   5) A merging candidate derived from B2 block in case the B2 block is    available-   6) A merging candidate derived from Col block in case the Col block    is available

The merging candidate list may include, for example, 0 to 5 mergingcandidates according to the number of available blocks. In case moreblocks are involved to derive merging candidates, more mergingcandidates can be included in the merging candidate list.

(5) Additional merging candidates are derived in case the number ofmerging candidates included in a merging candidate list is smaller thanthe maximum number of merging candidates which can be included in themerging candidate list.

An additional merging candidate may be either a merging candidategenerated by combining motion prediction-related information of theexisting merging candidates or a zero vector merging candidate. At thistime, the zero vector merging candidate refers to the merging candidatewhose motion vector is (0, 0).

(6) Among merging candidates included in a merging candidate list, amerging candidate applied for inter prediction of a current block isdetermined and motion prediction-related information of the mergingcandidate is set as the motion prediction-related information of thecurrent block.

In a decoding process, inter prediction by merging can be carried outfor a current block based on a merge index (merge_idx[xP][yP]) which isthe information about which candidate is used for inter prediction ofthe current block from among candidates included in a merging candidatelist.

Motion prediction-related information about a current block is derivedthrough the procedures (1) to (6) described above and inter predictionabout the current block is carried out by using the derived motionprediction-related information.

In what follows, an embodiment of the present invention additionallydescribes a method by which a parallel merge process is carried out forat least one prediction block by deriving one merging candidate list forat least one prediction block included in one coding block in using amethod for deriving a spatial merging candidate from a spatial mergingcandidate block of a current block (a prediction target block) of step(1). In what follows, an embodiment of the present invention assumes forthe convenience of description that one coding block is divided into aplurality of prediction blocks; however, the embodiment can be equallyapplied to the case where one coding block is not divided but the sizeof a coding block is equal to that of one prediction block.

The following embodiment describes a method for constructing a singlemerging candidate list with respect to a spatial and a temporal mergingcandidate. However, in the same way as the case where a mergingcandidate generated by combining motion prediction-related informationof spatial and/or temporal merging candidates is added to a mergingcandidate list or a zero merging candidate is added to a mergingcandidate list, the method can be applied in such a way that a pluralityof prediction blocks divided from one coding block uses a single mergingcandidate list determined based on a coding block.

To construct a single merging candidate list, a plurality of predictionblocks may share 1) both of a spatial merging candidate and a temporalmerging candidate, 2) only a spatial merging candidate, or 3) only atemporal merging candidate In the cases of 2) and 3), a mergingcandidate list for a prediction block may differ from each other;however, since only part of the candidates is shared, the term of singlemerging candidate is defined and used comprehensively for the purpose ofconvenience.

More specifically, a merging candidate list can be shared amongprediction blocks different from each other by using:

(1) a method for generating a single merging candidate list while aplurality of prediction blocks divided from one coding block share bothof a spatial and a temporal merging candidate determined based on acoding block;

(2) a method for generating a single merging candidate list while aplurality of prediction blocks divided from one coding block share onlya spatial merging candidate and a temporal merging candidate uses ablock derived based on each of prediction blocks; and

(3) a method for generating a single merging candidate list while aplurality of prediction blocks divided from one coding block share onlya temporal merging candidate and a spatial merging candidate uses ablock derived based on each of prediction blocks.

FIG. 6 is a conceptual drawing illustrating a method for generating asingle merging candidate list by sharing both a spatial mergingcandidate and a temporal merging candidate in a plurality of predictionblocks according to an embodiment of the present invention.

FIG. 6 describes a method for generating a single merging candidate listwhile a plurality of prediction blocks divided from one coding blockshare both of a spatial and a temporal merging candidate determinedbased on a coding block.

With reference to FIG. 6, a first prediction block 600 and a secondprediction block 650 derives a spatial merging candidate from the samespatial merging candidate block and shares the spatial mergingcandidate. The spatial merging candidate block about the first 600 andthe second prediction block 650 is determined based on a coding blockand A0 block 605, A1 block 610, B0 block 615, B1 block 620, and B2 block625 can be used as a spatial merging candidate block.

The position of each of spatial merging candidate blocks corresponds toa position including a pixel shown in the figure with respect to thetop-left position (xC, yC) and size nCS of the coding block.

The A0 block 605 corresponds to a block including a pixel at (xC−1,yC+nCS); the A1 block 610 a block including a pixel at (xC−1, yC+nCS−1);the B0 block 615 a block including a pixel at (xC+nCS, yC−1); the B1block 620 a block including a pixel at (xC+nCS−1, yC−1); the B2 block625 a block including a pixel at (xC−1, yC−1).

Also, the first 600 and the second prediction block 650 can share atemporal merging candidate. The temporal merging candidate block 660,670 which derives a temporal merging candidate shared by the first 600and the second prediction block 650 can also be derived as block locatedat a position derived based on the top-left position (xC, yC) and sizenCS of the coding block.

For example, if a prediction block including a pixel at (xC+nCS, yC+nCS)in a co-located picture of a current prediction block or a blockincluding a pixel at (xC+nCS, yC+nCS) is not available with respect to apixel position (xC, yC) within a picture including a prediction block, atemporal merging candidate block 660, 670 can serve as a predictionblock 670 including a pixel at (xC+(nCS>>1), yC+(nCS>>1)).

Inter prediction can be carried out by applying a parallel merge processfor individual prediction blocks by using a method for deriving a singlemerging candidate list and it is not necessary to separately derive amerging candidate list for each of prediction blocks. Therefore, byusing a single merging candidate list according to an embodiment of thepresent invention, a video processing speed can be enhanced for such adevice as UHDTV (ultra-high definition television) which requires asignificant amount of data processing.

Although the method illustrated in FIG. 6 divides a first N×2Nprediction block 600 and a second N×2N prediction block 650 into blocksof N×2N form, the method can also be applied to blocks (for example,2N×N, 2N×nU, nL×2N, nR×2N, or N×N) which are divided into predictionblocks of various other forms.

Also, the method can determine whether to apply a single mergingcandidate list differently according to the size or division depth of ablock. For example, based on the size of a block to which parallel mergeprocessing can be applied and size information of a coding block,information about whether a particular block uses a single mergingcandidate list. For example, information about whether a particularblock uses a single merging candidate list can be indicated by flaginformation. A flag indicating whether a particular block uses a singlemerging candidate list is defined by singleMCLflag. For example, ifsingleMCflag is 0, it indicates that the corresponding block does notuse a single merging candidate list while singleMCLflag is 1, itindicates that the corresponding block uses the single merging candidatelist. Based on the value of singleMCLflag, a spatial merging candidateabout a prediction block can be derived with respect to a coding block.

For example, based on the information that the size of a block to whichparallel merge processing can be applied has to be larger than 4×4 sizeand the size of a current block is 8×8, flag information indicating thatprediction blocks divided from an 8×8 coding block uses a single mergingcandidate list can be derived. The derived flag can be used later toderive a spatial merging candidate and a temporal merging candidate of aprediction block based on a coding block.

An additional description about the embodiment of the present inventionabove will be provided below.

FIG. 7 is a conceptual drawing illustrating a method for generating asingle merging candidate list by sharing only a spatial mergingcandidate in a plurality of prediction block according to an embodimentof the present invention.

FIG. 7 illustrates a method for generating a single merging candidatelist, where a plurality of prediction blocks divided from one codingblock share only a spatial merging candidate determined based on thecoding block while a temporal merging candidate uses a merging candidatederived based on each of the prediction blocks.

With respect to FIG. 7, a first prediction block 700 and a secondprediction block 750 can share the same spatial merging candidate Thespatial merging candidate block of the first 700 and the secondprediction block 750 is determined based on a coding block and A0 block750, A1 block 710, B0 block 715, B1 block 720, and B2 block 725 can beused as a spatial merging candidate block. Each block can be located ata position derived based on a coding block.

A temporal merging candidate block (or a co-located block) of the first700 and the second prediction block 750 can be derived based on theposition of each prediction block.

The first prediction block 700 uses at least one block between Hpu0block 755 and Mpu0 block 760, which are temporal merging candidatesdetermined based on its own block position, as a temporal mergingcandidate. The second prediction block 750 uses at least one blockbetween Hpu1 block 765 and Mpu1 block 770, which are co-located blocksdetermined based on its own block position, as a temporal mergingcandidate. As described above, the position of the temporal mergingcandidate block for deriving final motion prediction-related informationmay correspond to a position moved a little with respect to thepositions of Hpu0 block 755, Mpu0 block 760, Hpu1 block 765, and Mpu1block 770.

The temporal merging candidate blocks 755, 765, 770 belong to apre-encoded or decoded picture; and the first 700 and the secondprediction block 750 can carry out inter prediction by generating amerging candidate list in a parallel fashion.

FIG. 8 is a conceptual drawing illustrating a method for generating asingle merging candidate list by only a temporal merging candidate in aplurality of prediction block according to an embodiment of the presentinvention.

FIG. 8 illustrates a method for generating a single merging candidatelist, where a plurality of prediction blocks divided from one codingblock share only a temporal merging candidate determined based on thecoding block while a spatial merging candidate uses a merging candidatederived based on each of the prediction blocks.

With reference to FIG. 8, a first prediction block 800 and a secondprediction block 850 can derive spatial merging candidates differentfrom each other from the corresponding spatial merging candidate blocksaccording to the position and the size of each block.

The spatial merging candidate blocks of the first prediction block 800are A0 block 805, A1 block 810, B0 block 813, and B2 block 820; theposition of each block can be derived based on the position of thetop-left pixel of the first prediction block 800 and the size (width andheight) of the first prediction block 800.

For example, suppose the top-left pixel of the first prediction block is(xP, yP). A spatial merging candidate block of a prediction block thenconfigures such that a block including a pixel at (xP−1, yP+nPbH) is aleft first block (or A0 block, 805); a block including a pixel at (xP−1,yP+nPbH−1) a left second block (or A1 block, 810); a block including apixel at (xP+nPbW, yP−1) a top first block (or B0 block, 813); a blockincluding a pixel at (xP+nPbW−1, yP−1) a top second block (B1 block,815); and a block including a pixel at (xP−1, yP−1) a top third block(B2 block, 820).

Spatial merging candidate blocks of the second prediction block 850 areA0′ block 825, A1′ block 830, B0′ block 835, B1′ block 840, and B3′block 815; and the position of each block can be derived from theposition of the top left pixel of the second prediction block 850 andthe size (width and height) of the second prediction block 850.

For example, if the top-left pixel of the second prediction block is(xP, yP′), the spatial merging candidate block of the prediction blockconfigures such that a block including a pixel at (xP′−1, yP′+nPbH) is aleft first block (or A0′ block, 825); a block including a pixel at(xP′−1, yP′+nPbH−1) a left second block (or A1′ block, 830); a blockincluding a pixel at (xP′+nPbW, yP′−1) a top first block (or B0; block,835); a block including a pixel at (xP′+nPbW−1, yP′−1) a top secondblock (B1′ block, 840); and a block including a pixel at (xP′−1, yP′−1)a top third block (B2′ block, 815).

In other words, a spatial merging candidate can be derived based on theposition and the size of each prediction block 800, 850.

The temporal merging candidate block (or co-located block, 860, 870) ofthe first 800 and the second prediction block 850 is derived based on acoding block and the two prediction blocks can share the same temporalmerging candidate.

The method for deriving a single merging candidate list described abovecan also be used for generating an AMVP (advanced motion vectorprediction) list (or a motion vector predictor candidate list) in theinter prediction mode using AMVP (advanced motion vector prediction).

FIG. 9 is a conceptual drawing illustrating an inter-prediction modeusing AMVP.

To briefly describe inter prediction mode using AMVP with reference toFIG. 9, a spatial candidate prediction block used in an inter predictionmode using AMVP includes a left first block A0 900, a left second blockA1 910, a top first block B0 920, a top second block B1 930, and a topthird block B2 940. The spatial candidate prediction blocks can bedivided into two spatial candidate prediction groups, where a groupcomprising the left first block 900 and the left second block 910 isdefined as a first spatial candidate prediction group while a groupcomprising the top first block 920, the top second block 930, and thetop third block 940 is defined as a second spatial candidate predictiongroup.

The temporal candidate prediction block can include a prediction block50 including a pixel at (xP+nPbW, yP+nPbH) in a co-located picture of acurrent prediction block based on the pixel position (xP, yP) in apicture including the current prediction block; if a prediction blockincluding a pixel at (xP+nPbW, yP+nPbH) is not available, the temporalcandidate prediction block can include a prediction block 960 includinga pixel at (xP+(nPbW>>1), yP+(nPbH>>1)). In the same manner as merging,a final temporal merging candidate used for deriving final motionprediction-related information in AMVP may correspond to a block locatedat a position moved a little with respect to the positions of the first950 and the second temporal merging candidate 960.

An inter prediction method using AMVP generates a motion vectorprediction candidate list based on a motion vector derived from themotion vector derived from each of the spatial candidate predictiongroups and a motion vector derived from the temporal candidateprediction block. The motion vector of the derived motion vectorprediction candidate list can be used for carrying out inter predictionabout the current block.

A method for deriving a motion vector from a candidate prediction block(a spatial candidate prediction block or a temporal candidate predictionblock) can be carried out in a parallel fashion. For example, if onecandidate prediction motion vector is derived from each of two spatialcandidate prediction groups (a first spatial candidate prediction groupand a second spatial candidate prediction group) and one candidateprediction motion vector is derived from a temporal candidate predictionblock in case of deriving a candidate prediction motion vector, theoperation of deriving candidate prediction motion vectors from the firstspatial candidate prediction group, the second spatial candidateprediction group, and the temporal candidate prediction group can becarried out in a parallel fashion. Carrying out the process of derivingcandidate prediction motion vectors in a parallel fashion leads toreduction of complexity inherent in the process of deriving candidateprediction motion vectors. In other words, deriving a spatial candidateprediction motion vector from the first spatial candidate predictiongroup, deriving a spatial candidate prediction motion vector from thesecond spatial candidate prediction group, and deriving a temporalcandidate prediction motion vector from the temporal candidateprediction group can be carried out in a parallel fashion.

According to an embodiment of the present invention, inter predictionusing AMVP of each of prediction blocks divided from a coding block canalso be carried out in a parallel fashion.

In the same manner as merging, AMVP generates a motion vector predictioncandidate list for each prediction block in case one coding block isdivided into a plurality of prediction units. In this case, a spatialcandidate prediction block of a particular prediction block is includedin another prediction block and it has to wait for prediction to becompleted. Therefore, when a motion vector prediction candidate list isgenerated or a spatial candidate prediction block of a particularprediction block is located at a unencoded or undecoded position, thereare cases where a motion vector cannot be derived from the correspondingblock.

To solve the problem above and construct a motion vector predictioncandidate list, a spatial candidate prediction motion vector or atemporal candidate prediction motion vector can be derived by making aplurality of prediction blocks 1) share both of a spatial candidateprediction block and a temporal candidate prediction block, 2) shareonly the spatial candidate prediction block, or 3) share only a temporalcandidate prediction block. In cases of 2) and 3), motion vectorprediction candidate lists about a prediction block may differ from eachother; however, since only part of the candidates is shared, the term ofsingle motion vector prediction candidate list is defined and usedcomprehensively for the purpose of convenience.

More specifically, a motion vector prediction candidate list can beshared among prediction blocks different from each other by using:

(1) a method for generating a single motion vector prediction candidatelist while a plurality of prediction blocks divided from one codingblock share both of a spatial and a temporal candidate prediction blockderived based on the coding block;

(2) a method for generating a single motion vector prediction candidatelist while a plurality of prediction blocks divided from one codingblock share only a spatial merging candidate derived based on the codingblock and a temporal candidate prediction block uses a block derivedbased on each of prediction blocks; and

(3) a method for generating a single motion vector prediction list whilea plurality of prediction blocks divided from one coding block shareonly a temporal candidate prediction block derived based on the codingblock and a spatial candidate prediction block uses a block derivedbased on each of prediction blocks.

FIG. 10 is a conceptual drawing illustrating a method for generating asingle motion vector prediction candidate list by sharing both a spatialcandidate prediction block and a temporal candidate prediction block ina plurality of prediction blocks according to an embodiment of thepresent invention.

FIG. 10 illustrates a method for generating a single motion vectorprediction candidate list, where a plurality of prediction blocksdivided from one coding block share both of a spatial candidateprediction block and a temporal candidate prediction block determinedbased on the coding block. In the following embodiment, it is assumedthat all of motion vector prediction candidates derived from candidateprediction blocks are available.

With reference to FIG. 10, a first prediction block 1000 and a secondprediction block 1050 share the same spatial candidate prediction block.The spatial candidate prediction block of the first 1000 and the secondprediction block 1050 is determined based on a coding block, which cancorrespond to A0 block 1005, A1 block 1010, B0 block 1015, B1 block1020, and B2 block 1025.

The first 1000 and the second prediction block 1050 derives one motionvector prediction candidate based on the shared A0 1005 and A1 block1010 while one motion vector prediction candidate is derived based onthe B0 1015, B1 1020, and B2 block 1025.

In addition, the first 1000 and the second prediction block 1050 canshare a temporal candidate prediction block (or a co-located block 1050,1060). The first 1000 and the second prediction block 1050 can derives amotion vector prediction candidate from the shared temporal candidateprediction block (or the co-located block 1050, 1060).

In other words, the first 1000 and the second prediction block 1050 cangenerate a single motion vector prediction candidate list by usingmotion vector prediction candidates derived based on the spatialcandidate prediction blocks 1005, 1010, 1015, 1020, 1025 and thetemporal candidate prediction blocks 1050, 1060.

FIG. 11 is a conceptual drawing illustrating a method for generating asingle motion vector prediction candidate list by sharing only a spatialcandidate prediction block in a plurality of prediction blocks accordingto an embodiment of the present invention.

FIG. 11 illustrates a method for deriving a motion vector predictioncandidate, where a plurality of prediction blocks divided from onecoding block share only a spatial candidate prediction block determinedbased on the coding block. In other words, described is a method forgenerating a single motion vector prediction candidate list, where atemporal candidate prediction block derives a motion vector predictioncandidate from a block derived based on each of prediction blocks.

With reference to FIG. 11, a first prediction block 1100 and a secondprediction block 1150 share the same spatial candidate prediction block.The spatial candidate prediction block of the first 1100 and the secondprediction block 1150 is determined based on a coding block, which canshare A0 block 1105, A1 block 1110, B0 block 1115, B1 block 1120, and B2block 1025 and use the individual blocks as a spatial candidateprediction block.

Temporal candidate prediction blocks (or co-located blocks 1155, 1160,1165, 1170) of the first 1100 and the second prediction block 1150 canbe derived based on the positions of the individual prediction blocks.

The first prediction block 1100 uses at least one block from Hpu0 block1155 and Mpu0 block 1160, which are co-located blocks determined basedon their own positions, as a temporal candidate prediction block.

The second prediction block 1150 uses at least one block from Hpu1 block1165 and Mpu1 block 1170, which are co-located blocks determined basedon their own positions, as a temporal candidate prediction block.

The temporal candidate prediction blocks 1155, 1160, 1165, 1170 belongto a pre-encoded or pre-decoded picture; even when they do not share atemporal candidate prediction block, the first 1100 and the secondprediction block 1150 generate a motion vector prediction candidate listin a parallel fashion and thus carry out inter prediction.

FIG. 12 is a conceptual drawing illustrating a method for generating asingle motion vector prediction candidate list by sharing only atemporal candidate prediction block in a plurality of prediction blocksaccording to an embodiment of the present invention.

FIG. 12 illustrates a method for generating a single motion vectorprediction candidate list, where a plurality of prediction blocksdivided from one coding block share only a temporal candidate predictionblock determined based on the coding block and a spatial candidateprediction block uses a block derived based on each of predictionblocks.

With reference to FIG. 12, a first prediction block 1200 and a secondprediction block 1250 can use spatial candidate prediction blocksdifferent from each other with respect to the positions of individualprediction blocks. In other words, a spatial candidate prediction blockfor the first prediction block 1200 may correspond to A0 block 1205, A1block 1210, B0 block 1212, B1 block 1215, and B2 block 1220 while aspatial candidate prediction block for the second prediction block 1250may correspond to A0′ block 1225, A1′ block 1230, B0′ block 1235, B1′block 1240, and B2′ block 1215.

The temporal merging candidate block (or co-located block, 1260, 1270)of the first 1200 and the second prediction block 1250 is derived basedon a coding block and the two prediction blocks can share the sametemporal merging candidate.

In the inter prediction mode based on AMVP, a single motion vectorprediction candidate list can be generated differently according to areference picture index referred to by a block. For example, if acurrent picture (or a slice) has four reference pictures, up to fourreference picture indexes can be defined. In this case, since eachreference picture index can have a single motion vector predictioncandidate list, a total of ‘four’ single motion vector predictioncandidate lists can be generated and used for a target prediction block.

Also, encoding or decoding can be made to be carried out in such a waythat all the prediction blocks within a current encoding block use thesame reference picture index. In this case, since all of predictionblocks within the current encoding block have the same reference pictureindex, it suffices to have only one single motion vector predictioncandidate list. Whether to apply these methods can be determineddifferently according to the size or depth of the coding block.

In addition to the method described above, various other methods can beused to generate a single merging candidate list and a single motionvector prediction candidate list. In the following, a method forgenerating various candidate lists (single merging candidate list,single motion vector prediction candidate list) will be described.

FIG. 13 is a conceptual drawing illustrating a method for generating asingle merging candidate list according to an embodiment of the presentinvention.

Although FIG. 13 illustrates a method for generating a single mergingcandidate list for the convenience of description, it can still beapplied to a method for generating a single motion vector predictioncandidate list (AMVP list).

As described above, the position of a temporal merging candidate and aspatial merging candidate can be varied arbitrarily and at the sametime, the number of temporal merging candidates and spatial mergingcandidates can be changed.

With reference to FIGS. 13A and 13B, the position of a spatial mergingcandidate block and the position of a temporal merging candidate blockfor generating a single merging candidate list can be newly defined.

In FIG. 13A, the position of A1 block 1300 can be newly defined as theposition including a pixel at (xC−1, yC+nCS/2) while the position of B1block 1305 can be newly defined as the position including a pixel at(xC+nCS/2, yC−1).

Also, in addition to the existing position, the position at which atemporal merging candidate block can be derived can include H1 block1310, H2 block 1320, H3 block 1330, and H4 block 1340. In a co-locatedblock, the H1 block 1310 may correspond to the block including a pixelat (xC+nCS/2, yC+nCS); the H2 block 1320 the block including a pixel at(xC+nCS, yC+nCS/2); the H3 block 1330 the block including a pixel at(xC, yC+nCS); and the H4 block 1340 the block including a pixel at(xC+nCS, yC).

In FIG. 13B, the position of A1 block 1350 can be newly defined as theposition including a pixel at (xC−1, yC+nCS/2−1) while the position ofB1 block 1355 can be newly defined as the position including a pixel at(xC+nCS/2, yC−1).

Also, in addition to the existing position, the position of a temporalmerging candidate block can include H1 block 1360, H2 block 1360, H3block 1380, and H4 block 1390. In a co-located block, the H1 block 1360may correspond to the block including a pixel at (xC+nCS/2, yC+nCS); theH2 block 1370 the block including a pixel at (xC+nCS, yC+nCS/2); the H3block 1380 the block including a pixel at (xC, yC+nCS); and the H4 block1390 the block including a pixel at (xC+nCS, yC).

The method of generating a single merging candidate list and a singlemotion vector prediction candidate list above describes a method forgenerating a single merging candidate list and a single motion vectorprediction candidate list based on a coding block; and the method alsodescribes that the size of a coding block from which a single mergingcandidate list and a single motion vector prediction candidate list aregenerated may be limited. A concept of single candidate list can beintroduced to integrate the concept of single merging candidate list andsingle motion vector prediction candidate list.

Also, according to the embodiment of the present invention a singlecandidate list can be generated by using an ordinary block (for example,a block of a particular size including at least one coding block or atleast one prediction block) rather than a coding block. Also, the methodfor generating a single candidate list can also be applied only to oneinter prediction mode between merging and AMVP.

The specifics above can be summarized as shown in Table 1 below.

TABLE 1 Generation of a single merging Generation of a candidate listand Generation of a single motion a single motion single merging vectorprediction vector prediction candidate list candidate list candidatelist coding block based (A) (B) (C) (namely, shared among predictionblocks within the same coding block) Block size based (D) (E) (F)(namely, shared among prediction blocks belonging to an area of aparticular block size) coding block size (G) (H) (I) based (namely,shared among prediction blocks within the same coding block only whenthe size of the coding block is smaller than a particular size)

Table 1 classifies methods according to the block type from which asingle candidate list is generated, block size, and type of methodbetween merging and AMVP applied to the inter prediction by which asingle merging candidate list is generated.

FIG. 14 is a conceptual drawing illustrating a method for generating asingle merging candidate list according to an embodiment of the presentinvention.

FIG. 14 describes a method of sharing a single merging candidate listbased on a block in inter prediction using merge.

With reference to FIG. 14, the area indicated by solid lines representsa coding block while the area indicated by dotted lines represents aprediction block divided from the corresponding coding block. FIG. 14shows that a larger block unit including a plurality of coding blocks isused as the unit by which a spatial merging candidate block 1400, 1405,1410, 1415, 1420 and a temporal merging candidate block 1450 to 1480 arederived. In other words, a single merging candidate list can begenerated by a block larger than a coding block. Such information can beencoded and decoded as the information about a block to which parallelmerge processing can be applied. According to the embodiment of thepresent invention, whether a prediction block included in a particularcoding block carries out merging can be determined by using a singlemerging candidate list based on the information about a block to whichparallel merge processing can be applied and the information about acoding block including a prediction block.

A spatial merging candidate block belonging to a block to which parallelmerge processing can be applied from among spatial merging candidateblocks derived from a coding block belonging to a block to whichparallel merge processing can be applied is a unavailable block and maynot be used for deriving a spatial merging candidate. On the contrary aspatial merging candidate block belonging to the outside of a block towhich parallel merge processing can be applied can be used for derivinga spatial merging candidate during inter prediction by merging. In otherwords, a spatial merging candidate block belonging to a block to whichparallel merge processing can be applied may be determined as aunavailable spatial merging candidate block and may not be used toderive a spatial merging candidate.

To carry out the determination, determined is whether a current block (atarget prediction block) and a spatial merging candidate block of thecurrent block are included in a block to which the same parallel mergeprocessing can be applied. If the current block (the target predictionblock) and a spatial merging candidate block of the current block areincluded in a block to which the same parallel merge process can beapplied, the corresponding block is determined as unavailable and maynot be used for constructing a merging candidate list.

A temporal merging candidate block related to the block satisfying theabove conditions, too, can be derived based on a block to which parallelmerge processing can be applied. In other words, in case a predictionblock included in a particular coding block carries out merging by usinga single merging candidate list, the same temporal merging candidate forthe prediction block can be shared and used.

FIG. 15 is a conceptual drawing illustrating a method for generating asingle merging candidate list according to an embodiment of the presentinvention.

FIG. 15 describes a method for prediction blocks within the same codingblock to share a spatial merging candidate and a temporal mergingcandidate only when the size of the coding block is smaller than orequal to a particular size during inter prediction by merging.

Various kinds of information can be used to employ a method for sharinga single merging candidate list only for the blocks satisfyingparticular conditions. For example, information about whether a currentblock uses a single merging candidate list can be derived based on theinformation about the size of a block to which parallel merge processingcan be applied and the size information of a current encoding block.According to the derived information, a spatial merging candidate and atemporal merging candidate for a prediction block can be derived withrespect to a coding block satisfying particular conditions.

With reference to FIG. 15, for example, only when the size of a block towhich parallel merge processing can be applied is 8×8 or more and sizeof a coding block is 8×8, prediction blocks divided from the codingblock can share a single merging candidate list.

Now it is assumed that a first coding block CU0 1500 is a 32×32 block; asecond coding block CU1 1510 is a 16×16 block; a third coding block CU21520 is a 32×32 block; a fourth coding block CU3 1530 is a 16×16 block;and a fifth coding block CU4 1540 is a 8×8 block.

FIG. 15B is a conceptual drawing showing only a spatial mergingcandidate block about part of an coding block.

With reference to FIG. 15B, the second coding block 1510 is divided intotwo prediction blocks 1515, 1518 of nL×2N form while the fifth codingblock 1540 is divided into two prediction blocks 1545, 1550 of N×2Nform. FIG. 15B assumes that a single merging candidate list is generatedonly for a coding block of 8×8 size 1540.

A first prediction block 1515 and a second prediction block 1518 of thesecond coding block 1510 derive a spatial merging candidate for each ofthe prediction blocks and generate a merging candidate list for theindividual prediction blocks.

The size of the fifth coding block 1540 is 8×8 and satisfies theconditions imposed on the size of a block to which parallel mergeprocessing can be applied and the size of a current encoding block. Inthis case, a third prediction block 1545 and a fourth prediction block1550 included in the fifth coding block 1540 can generate a singlemerging candidate list based on a spatial merging candidate and atemporal merging candidate derived from the position and the size of thecoding block.

In other words, whether the size of a block defined to be to whichparallel merge processing can be applied is larger than a predeterminedparticular size and a coding block is of a particular size is determinedand if the size of the block defined to be to which parallel mergeprocessing can be applied is larger than the predetermined particularsize and the coding block is of the particular size, it can bedetermined that the prediction unit carries out merging by using thesingle merging candidate list.

A spatial merging candidate block belonging to a block to which parallelmerge processing can be applied from among spatial merging candidateblocks derived from a coding block belonging to a block to whichparallel merge processing can be applied may not be used for deriving aspatial merging candidate. On the contrary a spatial merging candidateblock belonging to the outside of a block to which parallel mergeprocessing can be applied can be used for inter prediction by merging.In other words, a spatial merging candidate block belonging to a blockto which parallel merge processing can be applied may be determined as aunavailable spatial merging candidate block and may not be used toderive a spatial merging candidate.

For example, to carry out the determination, determined is whether acurrent block (a target prediction block) and a spatial mergingcandidate block of the current block are included in a block to whichthe same parallel merge processing can be applied. If the current block(the target prediction block) and a spatial merging candidate block ofthe current block are included in a block to which the same parallelmerge processing can be applied, the corresponding spatial mergingcandidate block is determined as unavailable and may not be used forderiving a spatial merging candidate from a spatial merging candidateblock.

As described above, to generate a single merging candidate list for acoding block of a particular size, 1) information related to the size ofa block to which parallel merge processing can be applied during interprediction by merging and 2) a single merging candidate list flag(singleMCLflag) indicating that the corresponding block generates asingle merging candidate list based on the size information of a currentblock can be derived. Also, since which spatial merging candidate blockcorresponds to a unavailable block in deriving a spatial mergingcandidate can be known from 1) the information related to the size of ablock to which parallel merge processing can be applied during interprediction by merging, a spatial merging candidate may not be derivedfrom the corresponding block.

For example, suppose the size of the block to which parallel mergeprocessing can be applied is 8×8 and the size of a current encodingblock is 8×8. If the coding block and a spatial merging candidate blockderived based on the coding block belong to the same block to whichparallel merge processing can be applied, the spatial merging candidateblock can be determined as unavailable. In other words, in case thecoding block and the spatial merging candidate block derived based onthe coding block belong to a block to which different parallel mergeprocessing can be applied, the corresponding spatial merging candidateblock can be used for deriving a spatial merging candidate.

The derived single merging candidate list flag (singleMCLflag) isemployed subsequently when a spatial merging candidate and a temporalmerging candidate are derived and used for generating a single mergingcandidate list where the same merging candidates are shared byprediction blocks divided from a coding block of a particular size.

In what follows, an embodiment of the present invention describes withreference to Tables 2 to 5 information related to a block to whichparallel merge processing can be applied during inter prediction bymerging and syntax structure used for encoding the information into abit stream or decoding the bit stream.

TABLE 2 Descriptor seq_parameter_set_rbsp( ) {  profile_idc u(8) reserved_zero_8bits /* equal to 0 */ u(8)  level_idc u(8) ... ue(v) parallel_merge_enabled_flag u(1)  if(parallel_merge_enabled_flag)  parallel_merge_disabled_depth_info ue(v) ...

TABLE 3 Descriptor pic_parameter_set_rbsp( ) {  pic_parameter_set_idue(v)  seq_parameter_set_id ue(v)  entropy_coding_mode_flag u(1)  ... parallel_merge_enabled_flag u(1)  if(parallel_merge_enabled_flag)  parallel_merge_disabled_depth_info ue(v) ...

TABLE 4 Descriptor slice_header( ){  lightweight_slice_flag u(1)  if(!lightweight_slice_flag ) {   slice_type ue(v)   pic_parameter_set_idue(v)   frame_num u(v)  ...   parallel_merge_enabled_flag u(1)  if(parallel_merge_enabled_flag)    parallel_merge_disabled_depth_infoue(v) ...

TABLE 5 Descriptor slice_header( ) {  lightweight_slice_flag u(1)  if(!lightweight_slice_flag ) {   slice_type ue(v)   pic_parameter_set_idue(v)   frame_num u(v)  ...  }  if( entropy_coding_mode_flag &&slice_type != I)   cabac_init_idc ue(v)  first_slice_in_pic_flag u(1) ...  parallel_merge_enabled_flag u(1)  if(parallel_merge_enabled_flag)  parallel_merge_disabled_depth_info ue(v) ...

“parallel_merge_enabled_flag” included in the syntax of Tables 2 to 5can be used as information indicating whether to use a single mergingcandidate list based on a coding block. Also,“parallel_merge_enabled_flag” can include information about whether aparallel merge process is carried out.

For example, in case “parallel_merge_enabled_flag” is 1, it indicatesthat a method for generating a single merging candidate list has beenapplied based on a coding block and indicates a parallel merge processto be carried out whereas, in case “parallel_merge_enabled_flag” is 0,it may indicate that a single merging candidate list has not beenapplied and a parallel merge process is not applicable; and vice versa.Also, “parallel_merge_enabled_flag” can be used as the informationindicating whether to encode or decode all of the prediction blockswithin a coding block in a parallel fashion and as the informationindicating whether to construct a merging candidate list of all theprediction blocks within the coding block in a parallel fashion.

Meanwhile, “parallel_merge_disabled_depth_info” is activated when amethod for generating a single merging candidate list is applied basedon a coding block (for example, when “parallel_merge_enabled_flag” has atrue value), informing the applicability of a single merging candidatelist according to the depth or the size of the coding block.

For example, in case “parallel_merge_disabled_depth_info” is 0, thecorresponding method may not be applied if the depth of the coding blockis 0 (which corresponds to the largest coding block, for example, 64×64sized block). In case “parallel_merge_disabled_depth_info” is 1, thecorresponding method may not be applied if the depth of the coding blockis 1 (which corresponds to a size one step smaller than the largestcoding block, for example, 32×32 sized block).

As another example, in case “parallel_merge_disabled_depth_info” is 0,the corresponding method may not be applied if the depth of the codingblock is more than 0 (which corresponds to the largest coding block).Similarly, in case “parallel_merge_disabled_depth_info” is 1, thecorresponding method may not be applied if the depth of the coding blockis more than 1 (this case describes the sizes of the coding block exceptfor the largest coding block; for example, if the size of the largestcoding block is 64×64, the coding block size can take 32×32, 16×16, and8×8.)

As yet another example, in case “parallel_merge_disabled_depth_infor” is1, the corresponding method may not be applied if the depth of thecoding block is more than 1 (which corresponds to the coding block sizesexcept for the largest coding block).

The “parallel_merge_disabled_depth_info” is one example of informationrelated to a block to which parallel merge processing can be appliedduring inter prediction by merging; a different syntax element may beused to represent a parallel merge process during inter prediction bymerging and this embodiment also belongs to the technical scope of thepresent invention.

On the other hand, information about whether a parallel merge process isapplicable can be represented by using only“parallel_merge_disabled_depth_info” even if information such as“parallel_merge_enabled_flag” is not employed. For example, in case“parallel_merge_disabled_depth_info” corresponds to a particular value,it may indicate that a parallel merge process is not possible. And suchan embodiment also belongs to the technical scope of the presentinvention.

As still another example, log2_parallel_merge_level_minus2 can bedefined. log2_parallel_merge_level_minus2 indicates a level at which aparallel merge process can be applied. For example, if the value oflog2_parallel_merge_level_minus2 is 0, it indicates the size of a block(or a coding block) to which parallel merge processing can be applied is4×4. If it is assumed that the 4×4 block is the smallest coding block,it indicates that parallel merge processing is not carried out when thevalue of log2_parallel_merge_level_minus2 is 0. As another example, iflog2_parallel_merge_level_minus2 is 1, it indicates that parallel mergeprocessing can be applied to all of the prediction blocks belonging toan 8×8 sized block. If log2_parallel_merge_level_minus2 is 2, parallelmerge processing can be applied to all of the prediction blocksbelonging to a 16×16 sized block. If log2_parallel_merge_level_minus2 is3, parallel merge processing can be applied to all of the predictionblocks belonging to a 32×32 sized block. Iflog2_parallel_merge_level_minus2 is 4, parallel merge processing can beapplied to all of the prediction blocks belonging to a 64×64 sizedblock. In other words, by using the syntax element above, the size of ablock to which particular parallel merge processing can be applied isspecified. As described above, whether inter prediction using a singlemerging candidate list is carried out for at least one prediction blockincluded in a current block can be determined by using the informationabout the block to which parallel merge processing can be appliedderived through log2_parallel_merge_level_minus2 and the information ofthe current block (for example, size information). It can be determinedwhether a spatial merging candidate block derived based on a codingblock to derive a spatial merging candidate included in a single mergingcandidate list belongs to the block to which parallel merge processingcan be applied. For example, suppose the block for which parallel mergeprocessing is applied is an 8×8 sized block and the size of the currentencoding block is 8×8. If the coding block and a spatial mergingcandidate block derived based on the coding block belong to a block forwhich the same parallel merge processing can be applied, the spatialmerging candidate block can be determined a unavailable spatial mergingcandidate. In other words, if a coding block and a spatial mergingcandidate block derived based on the coding block belong to an block forwhich different parallel merge processing can be applied, thecorresponding spatial merging candidate block can be used for deriving aspatial merging candidate.

In the following embodiment of the present invention, a method forcarrying out encoding or decoding prediction blocks divided from onecoding block in a parallel fashion by using a single candidate listaccording to another embodiment will be described. The method to bedescribed can generate a single merging candidate list by sharing partof spatial candidates for a few prediction blocks within a coding block.

In sharing part of spatial candidates, too, by making the searchposition of a spatial merging candidate block of all the predictionblocks within the coding block always located outside of the codingblock, inter prediction can be made to be carried out in a parallelfashion in a prediction block within the coding block. Similarly, amerging candidate list can be generated by using a spatial mergingcandidate block located at a fixed position according to a divisionpattern of the block.

For example, complexity of a process for deriving a merging candidateduring inter prediction by merging can be reduced as each of theprediction blocks share part of spatial merging candidates.

For example, in selecting the search position of a spatial mergingcandidate of a prediction block outside of the coding block, thoseprediction blocks divided along a vertical direction (for example, inthe form of N×2N) can be made to share a spatial merging candidate blockin the left position from among outside positions of the coding block.Prediction blocks divided along a horizontal direction (for example, inthe form of 2N×N) can be made to share a spatial merging candidate blockin the top position from among outside positions of the coding block. Inother words, the number of deriving a spatial merging candidate can besignificantly reduced compared with the method which does not share amerging candidate.

Now, an embodiment of the above method will be described in more detailwith reference to a related drawing.

In the following embodiment, it is assumed that inter prediction bymerging is employed; however, the methods described later can also besued for inter prediction based on AMVP. Spatial merging candidateblocks and temporal merging candidate blocks used in a merging method inthe following correspond to a plurality of prediction blocks forconstructing a motion vector prediction candidate list with respect to aprediction block in the context of AMVP and can be interpreted asspatial candidate prediction blocks and temporal candidate predictionblocks.

In the following embodiment of the present invention, prediction blockscan be identified by using a division index of a divided block. In casethe division index is 0, it indicates a first prediction block while incase the division index is 1, it can be a second prediction block.

FIG. 16 is a conceptual drawing illustrating a method for generating amerging candidate list according to an embodiment of the presentinvention.

FIG. 16A illustrates a case where a coding block is divided into aprediction block of N×2N form. In case of a first prediction block 1600,a merging candidate list can be generated with respect to the positionof the first prediction block 1600 by using A0 block 1605, A1 block1610, B0 block 1615, B1 block 1629, and B2 block 1625 as the spatialmerging candidate block.

However, in case of a second prediction block 1650, if a spatial mergingcandidate block is derived based on the position of the secondprediction block, a part of spatial merging candidate blocks, A0 block1630 and A1 block 1635, may be located at the positions belonging to thefirst prediction block or at the position of a coding block not encodedyet. In case a spatial merging candidate block is located at suchposition, inter prediction by merging for the first 1600 and the secondprediction block 1650 cannot be carried out in a parallel fashion.Therefore, inter prediction by merging can be carried out by changingthe positions of the A0 block 1630 and the A1 block 1635 used as thespatial merging candidate block into A0′ block 1605 and A1′ block 1610located outside of the coding block and deriving a merging candidatelist about the second prediction block 1650. The A0′ block 1605 and theA1′ block 610 can be located at the same positions as those of spatialmerging candidate blocks of the first prediction block 1600.

FIG. 16B illustrates a case where a coding block is divided into aprediction block of 2N×N form. In case of a first prediction block 1660,a merging candidate list can be generated with respect to the positionof the first prediction block 1660 by using A0 block 1665, A1 block1667, B0 block 1673, B1 block 1675, and B2 block 1679 as the spatialmerging candidate block.

However, in case of a second prediction block 1690, if a spatial mergingcandidate block is derived based on the position of the secondprediction block 1690, a part of spatial merging candidate blocks, B0block 1685 and B1 block 1687, may be located at the positions belongingto the first prediction block 1660 or at the position of a coding blocknot encoded yet. In case a block is located at such position, interprediction by merging for the first 1660 and the second prediction block1690 cannot be carried out in a parallel fashion. Therefore, interprediction by merging can be carried out by changing the positions ofthe B0 block 1685 and the B1 block 1687 into A0′ block 1673 and A1′block 1675 located outside of the coding block and deriving a mergingcandidate list about the second prediction block 1690. The B0′ block1673 and the B1′ block 1675 can be located at the positions of spatialmerging candidate blocks employed by the first prediction block 1660.

To change the position of a spatial merging candidate block, it ischecked whether a current block (a target prediction block) and aspatial merging candidate block of the current block are included in theblock to which parallel merge processing can be applied. In case it isfound as a checking result that the current block (the target predictionblock) and the spatial merging candidate of the current block areincluded in the same block to which parallel merge processing can beapplied, the corresponding block may not be used for constructing amerging candidate list by determining it as unavailable.

FIG. 17 is a conceptual drawing illustrating a position of a spatialmerging candidate according to a division form of a coding blockaccording to an embodiment of the present invention.

With reference to FIG. 17, a spatial merging candidate can be derived byderiving spatial merging candidate blocks located at positions differentfrom each other according to the division pattern of a block. In otherwords, by making the positions of spatial merging candidate blocks ofall the prediction blocks located outside of a coding block whereencoding has been already completed, inter prediction by merging for aplurality of prediction blocks divided from one coding block in aparallel fashion can be made to be carried out. Also, complexity of aprocess for deriving a merging candidate list can be reduced by sharingpart of spatial merging candidate blocks intended for deriving a spatialmerging candidate.

FIG. 18 is a conceptual drawing illustrating a method for generating amerging candidate list according to an embodiment of the presentinvention.

FIG. 18A illustrates a case where a coding block is divided into aprediction block of N×2N form. In case of a first prediction block 1800,a merging candidate list can be generated with respect to the positionof the first prediction block 1800 by using A0 block 1805, A1 block1810, B0 block 1815, B1 block 1829, and B2 block 1825 as the spatialmerging candidate block.

However, in case of a second prediction block 1850, a spatial mergingcandidate block can be derived with respect to the position of a codingblock including the second prediction block 1850. In case a spatialmerging candidate block is derived with respect to the second predictionblock 1850, inter prediction by merging for the first 1800 and thesecond prediction block 1850 can be carried out in a parallel fashion.Therefore, a merging candidate list can be derived by using the blocks1805, 1830, 1835, 1825 as spatial merging candidate blocks, where theblocks are located outside of the coding block including the secondprediction block 1850 and at the block positions where encoding ordecoding has been already carried out.

FIG. 18B illustrates a case where a coding block is divided into aprediction block of 2N×N form. In case of a first prediction block 1860,a merging candidate list can be generated with respect to the positionof the first prediction block 1860 by using A0 block 1865, A1 block1870, B0 block 1875, B1 block 1880, and B2 block 1885 as the spatialmerging candidate block.

However, in case of a second prediction block 1895, inter prediction bymerging can be carried out by deriving a merging candidate list for thesecond prediction block by changing the blocks located at the positionsof the blocks located outside of the coding block, for which encoding ordecoding has already been carried out, into spatial merging candidateblocks 1887, 1889, 1875, 1880, 1885.

FIG. 19 is a conceptual drawing illustrating a position of a spatialmerging candidate according to a division form of a coding blockaccording to an embodiment of the present invention.

With reference to FIG. 19, spatial merging candidate blocks at differentpositions from each other according to the division patterns ofindividual blocks can be derived and used. In other words, by makingspatial merging candidate blocks of all the prediction blocks locatedoutside of the coding block for which encoding has already beencompleted, inter prediction by merging for a plurality of predictionblocks divided from one coding block can be carried out in a parallelfashion

FIG. 20 is a conceptual drawing illustrating a position of a spatialmerging candidate according to a division form of a coding blockaccording to an embodiment of the present invention.

With reference to FIG. 20A, in case of a horizontally divided form(2N×nU, 2N×nD, 2N×N) spatial merging candidate blocks at the sameposition can be used irrespective of division forms by using the spatialmerging candidate blocks at the same position, which are A0 block, A1block, B0 block, B1 block, and B2 block, for a second prediction block.

With reference to FIG. 20B, in case of a horizontally divided form(nL×2N, nR×2N, N×2N) spatial merging candidate blocks at the sameposition can be used irrespective of division forms by using the spatialmerging candidate blocks at the same position, which are A0 block, A1block, B0 block, B1 block, and B2 block, for a second prediction block.

A fixed position in FIG. 20 is one example of using a spatial mergingcandidate block at a fixed position in one coding block. In other words,the fixed position of a spatial merging candidate block can be changedand this embodiment also belongs to the technical scope of the presentinvention.

FIG. 21 is a conceptual drawing illustrating a position of a spatialmerging candidate according to a division form of a coding blockaccording to an embodiment of the present invention.

FIG. 21 illustrates a case where a coding block of a particular size isdivided into a plurality of coding blocks. In case the same mergingcandidate list is shared with respect to a block of a particular size, aspatial merging candidate block can be derived based on the position ofthe particular-sized block and a single merging candidate list can beconstructed by using the derived spatial merging candidate. In case of acoding block corresponding to the top-left of coding blocks included ina block of a particular size, even if spatial merging candidate blocksare derived with respect to the corresponding coding block, all of thespatial merging candidate blocks are located at the positions whereencoding has already been carried out; therefore, the top left codingblocks can be used separately by generating a different mergingcandidate list.

With reference to FIG. 21, among prediction blocks included in a blockof a particular size, the remaining prediction blocks except for theprediction block included in the top-left coding block 2100 can sharethe same spatial merging candidate blocks A0, A1, B0, B1, B2 derivedbased on the position of the particular-sized block.

However, in case of the top-left coding block 2100 amongparticular-sized blocks, inter prediction by merging can be carried outby using a spatial merging candidate block derived based on thecorresponding coding block. Since in case of the top-left coding block2100, spatial merging candidate blocks derived based on thecorresponding block are all located at available positions, the top-leftcoding block can carry out inter prediction by using spatial mergingcandidates derived from the spatial merging candidate blocks derivedwith respect to the position of the top-left coding block.

A temporal merging candidate can be derived based on the position of aparticular-sized block in the same way as a spatial merging candidate.The temporal merging candidate determines an available block in theorder of H0, H1, H2, H3, and H4 block; and incorporates the availableblock into a merging candidate list for later use. The temporal mergingcandidate can be scaled and used according to the picture number of areference picture. The temporal merging candidate can utilize not onlythe blocks at the boundary of a block X′ corresponding to FIG. 21 butalso the blocks M, N, O. P, Q located inside the block.

FIG. 22 is a conceptual drawing illustrating a position of a spatialmerging candidate according to a division form of a coding blockaccording to an embodiment of the present invention.

In case of a coding block distant from a spatial merging candidate blockwith respect to the size of a particular block, FIG. 22 illustrates amethod for generating a merging candidate list by using only temporalmerging candidates instead of using spatial merging candidates derivedfrom spatial merging candidate blocks derived based on the size of theparticular block.

With reference to FIG. 22, for example, a merging candidate list can begenerated by using only temporal merging candidates with respect to theblocks of the size specified as 1 2200. In other words, A block unit canbe specified, with which a merging candidate list is generated by usingonly temporal candidates by a particular specifier.

A temporal merging candidate determines an available block in the orderof H0, H1, H2, H3, and H4 block; and incorporates a temporal mergingcandidate derived from the available block into a merging candidate listfor later use. The motion vector derived from the temporal mergingcandidate can be scaled and used according to the picture number of areference picture. The temporal merging candidate can utilize not onlythe blocks at the boundary of a block X′ corresponding to FIG. 22 butalso the blocks M, N, O. P, Q located inside the block.

The methods described above all can have a different application rangeaccording to the size or depth of a coding block. A parameterdetermining the application range (namely, block size information orblock depth information) can be set up such that an encoder or a decoderuses a predetermined value or a value determined according to a profileor a level of a video encoding method. Also, if an encoder encodes aparameter value into a bit stream, a decoder may obtain the value fromthe bit stream for later use.

When there is needed to differentiate the application range according tothe depth of a coding block, the following classification may be appliedas shown in Table 6: A) a method applicable only for a depth more than apredetermined value, B) a method applicable only for a depth less thanthe predetermined value, and C) a method applicable only for a givendepth.

In case the depth of a coding block is 2, Table 6 illustrates an exampleof a method for determining an application range of A), B), and C)method (where 0 indicates applicability at the corresponding depthwhereas 1 indicates non-applicability at the corresponding depth).

TABLE 6 Depth of a coding block Method A Method B Method C 0 X ◯ X 1 X ◯X 2 ◯ ◯ ◯ 3 ◯ X X 4 ◯ X X

In case the methods of the present invention are not applied for theentire depth range, a flag such as parallel_merge_enabled_flagillustrated in Table 5 can be used to represent the corresponding case;or the corresponding information can be transmitted by beingincorporated into the syntax element representing depth information tobe applied. The case can be represented by signaling a value larger thanthe maximum depth value of a coding block by one as a depth value of thecoding block representing the application range.

FIG. 23 is a conceptual drawing illustrating a procedure through which aplurality of prediction blocks are decoded and encoded in a parallelfashion when a method for generating a single candidate list accordingto an embodiment of the present invention is used.

FIG. 23A assumes that one coding block is divided into two predictionblocks. For example, if the coding block satisfies particularconditions, parallel merge processing can be applied to the twoprediction blocks included in the coding block by using a single mergingcandidate list. For example, if the size of the coding block is aparticular value and is included in the size of a block to whichparallel merge processing can be applied, inter prediction by mergingcan be carried out by deriving a spatial merging candidate and atemporal merging candidate with respect to the coding block. Such amethod can be applied to various types of blocks.

FIG. 23B illustrates a case where encoding is carried out by using asingle merging candidate list for a coding block divided into variousforms. As shown in the figure, one coding block can be divided intovarious types of blocks. The divided prediction blocks can share amerging candidate list and carry out inter prediction by merging in aparallel fashion by using the shared merging candidate list. In otherwords, parallel encoding is possible for a plurality of predictionblocks included in one coding block. The method above can also beapplied to decoding.

By using the method above, complexity due to generation of a mergingcandidate list for each of prediction blocks can be reduced and at thesame time, video processing speed can be increased. In case of highresolution videos such as UHDTV, parallel processing is important incarrying out video processing. By using the method of the presentinvention, video processing in a parallel fashion is made possible.

The video encoding and decoding method described above can beimplemented in each constituting unit of the video encoder and the videodecoder described in FIGS. 1 and 2.

Although the present invention has been described with reference topreferred embodiments, it should be understood by those skilled in theart that the present invention can be modified and changed in variousways without departing from the technical principles and scope of thepresent invention defined by the appended claims.

What is claimed is:
 1. A method for encoding a video signal comprising:deriving, based on a position and a size of a coding block, at least onemerging candidate relating to a first prediction block, the coding blockcomprising the first prediction block and a second prediction block;generating a first merging candidate list for the first prediction blockbased on the merging candidate; obtaining prediction samples of thefirst prediction block based on the first merging candidate list;wherein the first merging candidate list for the first prediction blockis equivalent to a second merging candidate list for the secondprediction block included in the coding block with the first predictionblock.
 2. A recoding medium storing a bitstream formed by a method forencoding a video signal, the method comprising: deriving, based on aposition and a size of a coding block, at least one merging candidaterelating to a first prediction block, the coding block comprising thefirst prediction block and a second prediction block; generating a firstmerging candidate list for the first prediction block based on themerging candidate; obtaining prediction samples of the first predictionblock based on the first merging candidate list; wherein the firstmerging candidate list for the first prediction block is equivalent to asecond merging candidate list for the second prediction block includedin the coding block with the first prediction block.